Straightening out planar poly-line drawings
نویسنده
چکیده
This paper addresses the following question: Given a planar poly-line drawing of a graph, can we “straighten it out”, i.e., convert it to a planar straight-line drawing, while keeping some features unchanged? We show that any y-monotone poly-line drawing can be straightened out while maintaining y-coordinates and height. The width may increase much, but we also show that on some graphs exponential width is required if we do not want to increase the height. Likewise y-monotonicity is required: there are poly-line drawings (not y-monotone) that cannot be straightened out while maintaining the height. We give some applications of our result.
منابع مشابه
Transforming planar graph drawings while maintaining height
There are numerous styles of planar graph drawings, notably straight-line drawings, poly-line drawings, orthogonal graph drawings and visibility representations. In this note, we show that many of these drawings can be transformed from one style to another without changing the height of the drawing. We then give some applications of these transformations.
متن کاملStraightening Drawings of Clustered Hierarchical Graphs
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V,E) with an assignment of the vertices to horizontal layers, a plane drawing of G (with y-monotone edges) can be specified by stating for each layer the order of the vertices lying on and the edges intersecting that layer. Given these orders and a recursive partition of the vertices int...
متن کاملPlanar upward tree drawings with optimal area
Rooted trees are usually drawn planar and upward i e without crossings and with out any parent placed below its child In this paper we investigate the area requirement of planar upward drawings of rooted trees We give tight upper and lower bounds on the area of various types of drawings and provide linear time algorithms for constructing optimal area drawings Let T be a bounded degree rooted tr...
متن کاملUpward Tree Drawings with Optimal
Rooted trees are usually drawn planar and upward, i.e., without crossings and without any parent placed below its child. In this paper we investigate the area requirement of planar upward drawings of rooted trees. We give tight upper and lower bounds on the area of various types of drawings, and provide linear-time algorithms for constructing optimal area drawings. Let T be a bounded-degree roo...
متن کاملMorphing Planar Graphs Drawings Efficiently
A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all times. Each step of the morph moves each vertex at constant speed along a straight line. Although the existence of a morph between any two drawings was established several decades ago, only recently it has been proved tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1404.5892 شماره
صفحات -
تاریخ انتشار 2014